GMRES Convergence Bounds for Eigenvalue Problems
نویسندگان
چکیده
منابع مشابه
Computable Convergence Bounds for GMRES
The purpose of this paper is to derive new computable convergence bounds for GMRES. The new bounds depend on the initial guess and are thus conceptually different from standard “worst-case” bounds. Most importantly, approximations to the new bounds can be computed from information generated during the run of a certain GMRES implementation. The approximations allow predictions of how the algorit...
متن کاملHow Descriptive Are Gmres Convergence Bounds?
Eigenvalues with the eigenvector condition number, the eld of values, and pseu-dospectra have all been suggested as the basis for convergence bounds for minimum residual Krylov subspace methods applied to non-normal coeecient matrices. This paper analyzes and compares these bounds, illustrating with six examples the success and failure of each one. Reened bounds based on eigenvalues and the eld...
متن کاملConvergence of Inner-Iteration GMRES Methods for Least Squares Problems
We develop a general convergence theory for the generalized minimal residual method for least squares problems preconditioned with inner iterations. The inner iterations are performed by stationary iterative methods. We also present theoretical justifications for using specific inner iterations such as the Jacobi and SOR-type methods. The theory is improved particularly in the rankdeficient cas...
متن کاملConvergence of adaptive finite element methods for eigenvalue problems
In this article we prove convergence of adaptive finite element methods for second order elliptic eigenvalue problems. We consider Lagrange finite elements of any degree and prove convergence for simple as well as multiple eigenvalues under a minimal refinement of marked elements, for all reasonable marking strategies, and starting from any initial triangulation.
متن کاملOn the Convergence of the Arnoldi Process for Eigenvalue Problems
This paper takes another look at the convergence of the Arnoldi procedure forsolving nonsymmetric eigenvalue problems. Three different viewpoints are considered. The first usesa bound on the distance from the eigenvector to the Krylov subspace from the smallest singularvalue of matrix consisting of the Krylov basis. A second approach relies on the Schur factorization.Finally, a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Methods in Applied Mathematics
سال: 2017
ISSN: 1609-9389,1609-4840
DOI: 10.1515/cmam-2017-0017